Graphs with Conflict-Free Connection Number Two
نویسندگان
چکیده
منابع مشابه
Graphs with rainbow connection number two
An edge-coloured graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colours. The rainbow connection number of a connected graph G, denoted rc(G), is the smallest number of colours that are needed in order to make G rainbow connected. In this paper we prove that rc(G) = 2 for every connected graph G of order n and size m, where (
متن کاملNordhaus-Gaddum-type theorem for conflict-free connection number of graphs∗
An edge-colored graph G is conflict-free connected if, between each pair of distinct vertices, there exists a path containing a color used on exactly one of its edges. The conflict-free connection number of a connected graph G, denoted by cfc(G), is defined as the smallest number of colors that are needed in order to make G conflict-free connected. In this paper, we determine all trees T of ord...
متن کاملOn the (di)graphs with (directed) proper connection number two
A properly connected coloring of a given graph G is one that ensures that every two vertices are the ends of a properly colored path. The proper connection number of G is the minimum number of colors in such a coloring. We study the proper connection number for edge and vertex colorings, in undirected and directed graphs, respectively. More precisely, we initiate the study of the complexity of ...
متن کاملConflict-free connection of trees
An edge-colored graph G is conflict-free connected if, between each pair of distinct vertices, there exists a path containing a color used on exactly one of its edges. The conflict-free connection number of a connected graph G, denoted by cfc(G), is defined as the smallest number of colors that are required in order to make G conflict-free connected. A coloring of vertices of a hypergraph H = (...
متن کاملThe chromatic number of ordered graphs with constrained conflict graphs
An ordered graph G is a graph whose vertices are the first n positive integers. The edges are interpreted as tuples (u, v) with u < v. For a positive integer s, a matrix M ∈ Zs×4, and a vector p = (p, . . . , p) ∈ Z we build a conflict graph whose vertices are the edges of G by saying that edges (u, v) and (x, y) are conflicting ifM(u, v, x, y)> > p orM(x, y, u, v)> > p, where the comparison is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Graphs and Combinatorics
سال: 2018
ISSN: 0911-0119,1435-5914
DOI: 10.1007/s00373-018-1954-0